Dual periodicity in l1-norm minimisation problems
نویسنده
چکیده
The topic of this paper is the discrete-time l1-norm minimisation problem with convolution constraints. We find primal initial conditions for which the dual optimal solution is periodic. Periodicity of the dual optimal solution implies satisfaction of a simple linear recurrence relation by the primal optimal solution. c © 2007 Elsevier B.V. All rights reserved.
منابع مشابه
Wavelet-network Based on L1-norm Minimisation for Learning Chaotic Time Series
This paper presents a wavelet-neural network based on the L1-norm minimisation for learning chaotic time series. The proposed approach, which is based on multi-resolution analysis, uses wavelets as activation functions in the hidden layer of the wavelet-network. We propose using the L1-norm, as opposed to the L2-norm, due to the wellknown fact that the L1-norm is superior to the L2-norm criteri...
متن کاملA Primal Dual - Interior Point Framework for Using the L1-Norm or the L2-Norm on the Data and Regularization Terms of Inverse Problems
Maximum A Posteriori (MAP) estimates in inverse problems are often based on quadratic formulations, corresponding to a Least Squares fitting of the data and to the use of the L2 norm on the regularization term. While the implementation of this estimation is straightforward and usually based on the Gauss Newton method, resulting estimates are sensitive to outliers, and spatial distributions of t...
متن کاملAn L1-norm method for generating all of efficient solutions of multi-objective integer linear programming problem
This paper extends the proposed method by Jahanshahloo et al. (2004) (a method for generating all the efficient solutions of a 0–1 multi-objective linear programming problem, Asia-Pacific Journal of Operational Research). This paper considers the recession direction for a multi-objective integer linear programming (MOILP) problem and presents necessary and sufficient conditions to have unbounde...
متن کاملRESTRICTED ISOMETRY CONSTANTS WHERE l p SPARSE RECOVERY CAN FAIL FOR 0 < p ≤ 1
We investigate conditions under which the solution of an underdetermined linear system with minimal lp norm, 0 < p ≤ 1, is guaranteed to be also the sparsest one. Our results highlight the pessimistic nature of sparse recovery analysis when recovery is predicted based on the restricted isometry constants (RIC) of the associated matrix. We construct matrices with RIC δ2m arbitrarily close to 1/ ...
متن کاملOn the Problem of Finding the Least Number of Features by L1-Norm Minimisation
Recently, the so-called Support Feature Machine (SFM) was proposed as a novel approach to feature selection for classification. It relies on approximating the zero-norm minimising weight vector of a separating hyperplane by optimising for its one-norm. In contrast to the L1-SVM it uses an additional constraint based on the average of data points. In experiments on artificial datasets we observe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Systems & Control Letters
دوره 57 شماره
صفحات -
تاریخ انتشار 2008